Assortment Optimization with Visibility Constraints
نویسندگان
چکیده
منابع مشابه
Assortment optimization over time
In this note we introduce the problem of assortment optimization over time. We have a sequence of time steps and can introduce one new product per time step. Once introduced a product can not be removed. The goal is to determine which products to introduce so as to maximize revenue over all time steps under some choice model. Given a 1/α-approximation algorithm for the capacitated assortment op...
متن کاملCombinatorial Assortment Optimization
Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience store. The price of each product is fixed in advance, and a probabilistic choice function describes which product a customer will choose from any given subset. We introduce the combinatorial assortment problem, where each customer may select ...
متن کاملAssortment Optimization for Choosy Customers
We study two different choice models that capture the purchasing behavior of customers who only consider purchasing one of two substitutable products. We refer to these customers as choosy. The first choice model captures substitution behavior through probabilistic transitions between products. Under this choice model, a customer’s buying process can be captured in two steps: an arrival with th...
متن کاملAssortment Optimization under General Choice
We consider the static assortment optimization problem – a central decision problem faced by operations managers that has been widely studied in the literature. The decision deals with finding the assortment of products (from a larger universe of products) that maximizes the expected revenue subject to a constraint on the size of the assortment. More concretely, if N = {1, 2, . . . , N} denotes...
متن کاملMulti-Level 3D Reconstruction with Visibility Constraints
In this paper, we examine the problem of 3D reconstruction from a large number of images annotated with camera pose information. Our proposed method involves computing 3D descriptions of the scene at multiple levels of representation (vertex, line segment, and surface) simultaneously. A major problem encountered during bottom-up processing is the uncertainty of low-level feature correspondence,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2023
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4520874